Experimental Descriptive Complexity
نویسندگان
چکیده
We describe our development and use of DescriptiveEnvironment (DE). This is a program to aid researchers in Finite Model Theory and students of logic to automatically generate examples, counterexamples of conjectures, reductions between problems, and visualizations of structures and queries. DescriptiveEnvironment is available for free use under an ISC license at http://www.cs.umass.edu/∼immerman/de . We encourage researchers and students at all levels to experiment with it. Please tell us of your insights, progress, suggestions, or extensions of DE.
منابع مشابه
Inferring the causal decomposition under the presence of deterministic relations
The presence of deterministic relations pose problems for current algorithms that learn the causal structure of a system based on the observed conditional independencies. Deterministic variables lead to information equivalences; two sets of variables have the same information about a third variable. Based on information content, one cannot decide on the direct causes. Several edges model equall...
متن کاملMachine Learning with Guarantees using Descriptive Complexity and SMT Solvers
Machine learning is a thriving part of computer science. There are many efficient approaches to machine learning that do not provide strong theoretical guarantees, and a beautiful general learning theory. Unfortunately, machine learning approaches that give strong theoretical guarantees have not been efficient enough to be applicable. In this paper we introduce a logical approach to machine lea...
متن کاملInductive Inference by Using Information Compression
Inductive inference is of central importance to all scientific inquiries. Automating the process of inductive inference is the major concern of machine learning researchers. This article proposes inductive inference techniques to address three inductive problems: (1) how to automatically construct a general description, a model, or a theory to describe a sequence of observations or experimental...
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملThe Computational Complexity Column Progress in Descriptive Complexity
Exploration of the connections between computational complexity, descriptive complexity, and logic remains one of the most active and important areas of theoretical computer science. In this edition of the Computational Complexity Column, we hear from one of the leaders in this area.
متن کامل